A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
نویسندگان
چکیده
منابع مشابه
A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem.
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We tested one such algorithm by applying it to randomly generated hard instances of an NP-complete problem. For the small examples that we could simulate, the quantum ad...
متن کاملAdiabatic quantum optimization fails for random instances of NP-complete problems
Abstract Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed hard instances where adiabatic optimization requires exponential time. In spite of this, there was still hope that this would not happen for random i...
متن کاملUltrafast adiabatic quantum algorithm for the NP-complete exact cover problem
An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advan...
متن کاملThe Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function (ground state energy). Random optimization problems provide a natural testbed to compare its efficiency with that of classical algorithms. These problems corres...
متن کاملNp Problem in Quantum Algorithm
In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 2001
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.1057726